Degree-Distribution Stability of Growing Networks
نویسندگان
چکیده
In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady degree distribution exists and get its exact formulas. Then we apply it to various growing networks. With this method, we get a rigorous, exact and unified solution of the steady degree distribution for growing networks.
منابع مشابه
ar X iv : 0 80 8 . 36 61 v 4 [ m at h - ph ] 2 3 A pr 2 00 9 Degree - distribution Stability of Growing Networks ∗
In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady ...
متن کاملThe Stability of Growing Networks
In this paper we abstract a kind of stochastic processes from evolving processes of growing networks, which are called as growing network Markov chains,threrefore the existence of the steady degree distribution and the formulas of the degree distribution are transformed to the corresponding problems of growing network Markov chains. We divide growing network markov chains into two classes: non-...
متن کاملMarkov chain-based stability analysis of growing networks
From the perspective of probability, the stability of growing network is studied in the present paper. Using the DMS model as an example, we establish a relation between the growing network and Markov process. Based on the concept and technique of first-passage probability in Markov theory, we provide a rigorous proof for existence of the steady-state degree distribution, mathematically re-deri...
متن کاملOptimal Placement and Sizing of DGs and Shunt Capacitor Banks Simultaneously in Distribution Networks using Particle Swarm Optimization Algorithm Based on Adaptive Learning Strategy
Abstract: Optimization of DG and capacitors is a nonlinear objective optimization problem with equal and unequal constraints, and the efficiency of meta-heuristic methods for solving optimization problems has been proven to any degree of complex it. As the population grows and then electricity consumption increases, the need for generation increases, which further reduces voltage, increases los...
متن کاملRobustness in a space of complex networks
Models of complex networks have various properties which can be measured in real networks (WWW, social networks, biological networks), e.g. degree distribution, modularity, hierarchy, assortativity etc. Determining how robust these models are could have important implications for real-world network stability, but this direction of research has seen only some progress. For example, it was shown ...
متن کامل